GRASPER A framework for graph CSPs
نویسندگان
چکیده
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the context of biochemical networks showing promising results, when compared to an existing similar solver, in this early stage of development.
منابع مشابه
GRASPER: constraint reasoning with graphs
In this paper we present GRASPER, a graph constraint solver based on set constraints. GRASPER is a constraint logic-based reasoning framework aiming to provide a powerful, efficient and intuitive framework for modelling and solving hard combinatorial problems by introducing graph variables. We specify GRASPER’s core and higher level constraints and make use of it to model a problem in the conte...
متن کاملThe Grasper - CL Graph Management
Grasper-CL is a system for manipulating and displaying graphs, and for building graph-based user interfaces for application programs. It is implemented in COMMON LISP and CLIM, and has been proven by use in a number of applications. Grasper-CL includes several advances in graph drawing. It contains a graph abstract datatype plus a comprehensive and novel language of operations on that datatype....
متن کاملA generic bounded backtracking framework for solving CSPs
This paper introduces a new generic backtracking framework for solving CSPs. This scheme exploits semantic and topological properties of the constraint network to produce goods and nogoods. It is based on a set of separators of the constraint graph and several procedures adjustable to exploit heuristics, filtering, backjumping techniques, classical nogood recording, topological (no)good recordi...
متن کاملA Comparison of Structural CSP Decomposition
We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory, and analyze the cost of solving CSPs having bounded hypertree-width. We provide a framework for compa...
متن کاملA filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation
In this paper, we are interesting in using a partial consistency, issued from relational databases theory, within the Constraint-Satisfaction Problems (CSPs) framework : pairwise-consistency. This partial consistency concerns general CSPs (i.e. CSPs the constraints of which may involve more than two variables). We provide a polynomial algorithm for achieving it; then we can extend the class of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007